A golden ratio parameterized algorithm for Cluster Editing
نویسندگان
چکیده
منابع مشابه
A Golden Ratio Parameterized Algorithm for Cluster Editing
The Cluster Editing problem asks to transform a graph by at most k edge modifications into a disjoint union of cliques. The problem is NP-complete, but several parameterized algorithms are known. We present a novel search tree algorithm for the problem, which improves running time from O(1.76 + m + n) to O(1.62 + m + n) for m edges and n vertices. In detail, we can show that we can always branc...
متن کاملEfficient Parameterized Preprocessing for Cluster Editing
In the Cluster Editing problem, a graph is to be changed to a disjoint union of cliques by at most k operations of edge insertion or edge deletion. Improving on the best previously known quadratic-size polynomial-time kernelization, we describe how a crown-type structural reduction rule can be used to obtain a 6k kernelization bound.
متن کاملGoing Weighted: Parameterized Algorithms for Cluster Editing
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper we present a surprisingly simple branching strategy for Cluster Editing. We generalize the problem assuming that edge inse...
متن کاملParameterized mixed cluster editing via modular decomposition
In this paper we introduce a natural generalization of the well-known problems Cluster Editing and Bicluster Editing, whose parameterized versions have been intensively investigated in the recent literature. The generalized problem, called Mixed Cluster Editing or M-Cluster Editing, is formulated as follows. Let M be a family of graphs. Given a graph G and a nonnegative integer k, transform G, ...
متن کاملEven faster parameterized cluster deletion and cluster editing
Cluster Deletion and Cluster Editing ask to transform a graph by at most k edge deletions or edge edits, respectively, into a cluster graph, i.e., disjoint union of cliques. Equivalently, a cluster graph has no conflict triples, i.e., two incident edges without a transitive edge. We solve the two problems in time O∗(1.415k) and O∗(1.76k), respectively. These results round off our earlier work b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.04.005